Quantum proofs can be verified using only single-qubit measurements
نویسندگان
چکیده
منابع مشابه
Quantum proofs can be verified using only single qubit measurements
QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical complexity class NP (and its probabilistic variant MA, Merlin-Arthur games), where the verifier has only classical computational resources. In this paper, we stud...
متن کاملQuantum theory can be collectively verified
No theory of physics has been collectively scientifically verified in an experiment so far. It is pointed out that probabilistic structure of quantum theory can be collectively scientifically verified in an experiment. It is also argued that experimentalist’s point of view quantum theory is a complete theory. Generally, a proposed theory of physics is accepted by scientific community when it is...
متن کاملQuantum Arthur-Merlin with single-qubit measurements
Tomoyuki Morimae ∗ ASRLD Unit, Gunma University, 1-5-1 Tenjin-cho Kiryu-shi Gunma-ken, 376-0052, Japan Abstract We show that the class QAM does not change even if the verifier’s ability is restricted to only single-qubit measurements. To show the result, we use the idea of the measurement-based quantum computing: the verifier, who can do only single-qubit measurements, can test the graph state ...
متن کاملWhat Can Be Verified Locally?
We are considering distributed network computing, in which computing entities are connected by a network modeled as a connected graph. These entities are located at the nodes of the graph, and they exchange information by message-passing along its edges. In this context, we are adopting the classical framework for local distributed decision, in which nodes must collectively decide whether their...
متن کاملQuantum state and circuit distinguishability with single-qubit measurements
Abstract We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit measurements. To show these results, we use measurement-based quantum computing: the honest prover sends a graph state to the verifier, and the verifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2016
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.93.022326